sequential algorithmの例文

• He has done extensive work in the design and analysis of parallel and sequential algorithms.
• Church and Turing did not solve the problem of formalizing the notion of sequential algorithm.
• "Sequential algorithm " may also refer specifically to an algorithm for decoding a convolutional code.
• Measurements show that the implementation outperforms Felzenszwalb's sequential algorithm by an order of magnitude.
• Concurrency control can require significant additional complexity and overhead in a concurrent algorithm compared to the simpler sequential algorithm.
• A toolchain has since developed, including an transpiles to TLA + and is useful for specifying sequential algorithms.
• Further, non-parallel, non-concurrent algorithms are often referred to as " sequential algorithms ", by contrast with concurrent algorithms.
• :" It is often thought that the problem of formalizing the notion of sequential algorithm was solved by Church [ 1936 ] and Turing [ 1936 ].
• For simple stateless applications with minimal sharing of conditions across rules, a non-Rete-based execution algorithm ( such as the sequential algorithm ) may be preferable.
• The parallel version of the algorithm can be seen as a special case of the sequential algorithm shown above, and so this result also holds for the sequential case.
• For evaluating decision tables and trees, an algorithm that exploits the hierarchical relationships between the rule conditions may perform better than a simple Rete or sequential algorithm tuned for discrete rules.
• On the other hand, many researchers use a pool of processors to speed up the execution of a sequential algorithm, just because independent runs can be made more rapidly by using several processors than by using a single one.
• For example, an algorithm that can be solved in O ( n ) time using the best known sequential algorithm and O \ left ( \ frac { n } { p } \ right ) in a parallel computer with p processors will be considered cost efficient.
• However, there are other execution algorithms such as the sequential algorithm ( ILOG and Blaze Advisor terminology ), algorithms for evaluating decision tables / trees, and algorithms tuned for hierarchical XML . The Rete algorithm is a stateful pattern matching algorithm designed to minimize the evaluation of repetitive tests across many objects / attributes and many rules.
• An even simpler linear-time sequential algorithm (, Lemma 1 ) does not even need a stack; it assumes that the input sequence is given as an array A [ 1, n ], and stores the index j of the preceding smaller value of the i'th value A [ i ] in P [ i ].
• Our article on Biconnected components mentions a " classic sequential algorithm for computing biconnected components in a connected graph due to John Hopcroft and Robert Tarjan ( 1971 ) "-- does anyone what this algorithm is, and if there's a description of it online ? & mdash; Matt Crypto 16 : 42, 14 February 2009 ( UTC)